A reactive path relinking algorithm for solving the bi-objective p-Median and p-Dispersion problem

Abstract This paper deals with an interesting facility location problem known as the bi-objective p -Median and -Dispersion ( BpMD problem). The seeks to locate facilities service a set of n demand points, goal is minimize total distance between points and, simultaneously, maximize minimum all pairs hosted facilities. addressed novel path relinking approach, called reactive relinking, which hybridizes two most extended variants: interior exterior relinking. Additionally, proposal adapted multi-objective perspective for finding good approximation Pareto front. Computational results prove superiority proposed algorithm over best procedures found in literature.